On the diophantine equation $(x^3-1)/(x-1)=(y^n-1)/(y-1)$
نویسندگان
چکیده
منابع مشابه
The diophantine equation x3 3 + y3 + z 3 − 2xyz = 0
We will be presenting two theorems in this paper. The first theorem, which is a new result, is about the non-existence of integer solutions of the cubic diophantine equation. In the proof of this theorem we have used some known results from theory of binary cubic forms and the method of infinite descent, which are well understood in the purview of Elementary Number Theory(ENT). In the second th...
متن کاملOn searching for solutions of the Diophantine equation x3 + y3 +2z3 = n
We propose an efficient search algorithm to solve the equation x3 + y3 + 2z3 = n for a fixed value of n > 0. By parametrizing |z|, this algorithm obtains |x| and |y| (if they exist) by solving a quadratic equation derived from divisors of 2|z|3±n. Thanks to the use of several efficient numbertheoretic sieves, the new algorithm is much faster on average than previous straightforward algorithms. ...
متن کاملON THE DIOPHANTINE EQUATION xn − 1 x −
We prove that if (x, y, n, q) 6= (18, 7, 3, 3) is a solution of the Diophantine equation (xn−1)/(x−1) = y with q prime, then there exists a prime number p such that p divides x and q divides p − 1. This allows us to solve completely this Diophantine equation for infinitely many values of x. The proofs require several different methods in diophantine approximation together with some heavy comput...
متن کاملOn the Diophantine equation |axn - byn | = 1
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptions of (a, b, n) satisfying b = a + 1, 2 ≤ a ≤ min{0.3n, 83} and 17 ≤ n ≤ 347. The proof of this result relies on a variety of diophantine approximation techniques including those of rational approximation to hypergeometri...
متن کاملOn the Diophantine Equation
In this paper, we study the Diophantine equation x2 + C = 2yn in positive integers x, y with gcd(x, y) = 1, where n ≥ 3 and C is a positive integer. If C ≡ 1 (mod 4) we give a very sharp bound for prime values of the exponent n; our main tool here is the result on existence of primitive divisors in Lehmer sequence due Bilu, Hanrot and Voutier. When C 6≡ 1 (mod 4) we explain how the equation can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1999
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-99-02013-9